MONSTR II - Suspending Semantics and Independence
نویسنده
چکیده
The suspending semantic model for the execution of the MONSTR generalised term graph rewriting language is defined. This is the canonical operational semantic model for the MONSTR language. Its correctness with respect to DACTL semantics is discussed, and a number of general theorems on the soundness of suspending executions with respect to DACTL semantics are proved. General theorems are proved about the independence of suspending primitive actions, which are useful in the verification of MONSTR systems.
منابع مشابه
MONSTR V - Transitive Coercing Semantics and the Church-Rosser Property
The transitive coercing semantic model for the execution of the MONSTR generalised term graph rewriting language is defined. Of all the operational semantics for MONSTR that one might consider, this one has the cleanest properties. Under intuitively obvious conditions for executions involving redexes permitted to overlap sufficiently to allow the programming of deterministic synchronisations, a...
متن کاملA Fibration Semantics for Pi-Calculus Modules via Abstract MONSTR Rule Systems
MONSTR Rule Systems R. Banach Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
متن کاملExpressing Runtime Structure and Synchronisation in Concurrent OO Languages with MONSTR
The extended term graph rewriting formalism of MONSTR is described, together with some of its more important rigorously established properties, particularly regarding serialisability and acyclicity. This basis is used for giving a convenient description of the global runtime structure of a concurrent object oriented language. The formalism proves especially convenient for describing very precis...
متن کاملMONSTR I - Fundamental Issues and the Design of MONSTR
This is the first in a series of papers dealing with the implementation of an extended term graph rewriting model of computation (described by the DACTL language) on a distributed store architecture. In this paper we set out the high level model, and under some simple restrictions, prove an abstract packet store implementation correct modulo garbage. The abstract packet store model is compared ...
متن کاملA Translation of the Pi-Caculus Into MONSTR
A translation of the π-calculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the π-calculus and similar process calculi. It also illustrates the convenience of representing an evolving network of communicating agents directly within a graph manipulation f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 3 شماره
صفحات -
تاریخ انتشار 1997